Roots of sparse polynomials over a finite field
نویسندگان
چکیده
منابع مشابه
Roots of sparse polynomials over a finite field
For a t-nomial f(x) = ∑t i=1 cix ai ∈ Fq[x], we show that the number of distinct, nonzero roots of f is bounded above by 2(q− 1)1−εCε, where ε = 1/(t− 1) and C is the size of the largest coset in Fq on which f vanishes completely. Additionally, we describe a number-theoretic parameter depending only on q and the exponents ai which provides a general and easily computable upper bound for C. We t...
متن کاملSparse univariate polynomials with many roots over finite fields
Suppose q is a prime power and f ∈ Fq[x] is a univariate polynomial with exactly t nonzero terms and degree <q−1. To establish a finite field analogue of Descartes’ Rule, Bi, Cheng and Rojas (2013) proved an upper bound of 2(q − 1) t−2 t−1 on the number of cosets in F∗ q needed to cover the roots of f in F∗ q . Here, we give explicit f with root structure approaching this bound: For q a t power...
متن کاملFinding roots of polynomials over finite fields
In this letter, we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose–Chaudhuri–Hocquenghem, Reed–Solomon, and some other error-correcting codes.
متن کاملRoots and coefficients of polynomials over finite fields
In this note, we give a short proof of a result of Muratović-Ribić and Wang on the relation between the the coefficients of a polynomial over a finite field Fq and the number of fixed points of the mapping on Fq induced by that polynomial.
متن کاملCryptographic Applications of Sparse Polynomials over Finite Rings
This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems and identification schemes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2016
ISSN: 1461-1570
DOI: 10.1112/s1461157016000334